Embedding knowledge into stochastic learning automata for fast solution of binary constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
The Ability of Learning Automata in Solving Constraint Satisfaction Problems
In this paper we have investigated the performance of some stochastic methods for solving constraint satisfaction (CSP) and fuzzy constraint satisfaction problems (FCSP). The purpose of this paper is to study the abilities of learning automaton in solving these problems and comparing it with other stochastic methods. The results confirm those of [2] and show its superiority to other methods.
متن کاملStochastic solver for constraint satisfaction problems with learning of high-level characteristics of the problem topography
A new generic method for solving constraint satisfaction problems is presented. The method is based on stochastic search which is non-local in the sense that at any point in the search, the next state sampled may be arbitrarily far from the current state. The solver relies heavily on knowledge of the high-level characteristics of the topography defining the problem. It obtains these characteris...
متن کاملA Family of Stochastic Methods For Constraint Satisfaction and Optimisation
Constraint satisfaction and optimisation is NP-complete by nature. The combinatorial explosion problem prevents complete constraint programming methods from solving many real-life constraint problems. In many situations, stochastic search methods, many of which sacrifice completeness for efficiency, are needed. This paper reports a family of stochastic algorithms for constraint satisfaction and...
متن کاملParticle Swarm in Binary CSPs with Dynamic Variable Ordering
The variable ordering of constraint satisfaction problems affect the performance of search algorithms in CSPs. Dynamic Variable Ordering (DVO) has more advantage in improving the performance of search algorithms than static variable ordering. It is a newly developed method recent years that using particle swarm algorithm to solve binary constraint satisfaction problems, which is a global stocha...
متن کاملConnectionist Approach for SolvingLarge Constraint Satisfaction
An eecient neural network technique is presented for the solution of binary constraint satisfaction problems. The method is based on the application of a double-update technique to the operation of the discrete Hoppeld{type neural network that can be constructed for the solution of such problems. This operation scheme ensures that the network moves only between consistent states, such that each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993